On Relational Properties of Lumpability
نویسندگان
چکیده
The technique of lumping of Markov chains is one of the main tools for recovering from state explosion in the quantitative analysis of large probabilistic systems. Useful results regarding relational properties of general, ordinary and exact lumpability, in particular transitivity and strict confluence, are rather scattered or implicit in the literature. These are collected and reformulated here from a process-theoretic point of view. Additionally, counterexamples are provided that complete the picture. Keywords—Probabilistic systems, general lumpability, ordinary and exact lumpability, transitivity, strict confluence
منابع مشابه
A geometric invariant in weak lumpability of finite Markov chains
We consider weak lumpability of finite homogeneous Markov chains, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpability is equivalent to the existence of a direct sum of polyhedral cones which is is positively invariant by the transition probability matrix of the original chain. It allows us, i...
متن کاملWeighted Lumpability on Markov Chains
This paper reconsiders Bernardo’s T-lumpability on continuous-time Markov chains (CTMCs). This notion allows for a more aggressive state-level aggregation than ordinary lumpability. We provide a novel structural definition of (what we refer to as) weighted lumpability, prove some elementary properties, and investigate its compatibility with linear real-time objectives. The main result is that t...
متن کاملOn Weak Lumpability of Denumerable Markov Chains
We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we are concerned with irreducible recurrent positive and R-positive Markov chains evolving in discrete time. We study the properties of the set of all initial distributions of the starting chain leading to an aggregated homogeneous Markov chain with respect to a partition of the state space. In parti...
متن کاملTowards State Space Reduction Based on T-Lumpability-Consistent Relations
Markovian behavioral equivalences can be exploited for state space reduction before performance evaluation takes place. It is known that Markovian bisimilarity corresponds to ordinary lumpability and that Markovian testing and trace equivalences correspond to a coarser exact relation we call T-lumpability. While there exists an ordinarylumpability-consistent aggregation algorithm, this is not t...
متن کاملWeak Lumpability of Finite Markov Chains and Positive Invariance of Cones
We consider weak lumpability of general nite homogeneous Markov chains evolving in discrete time, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpabilityis equivalent to the existence of a decomposable polyhedral cone which is positively invariant by the transition probability matrix of the origi...
متن کامل